Frequency sequences in graphs
نویسندگان
چکیده
منابع مشابه
Dominating sequences in graphs
A sequence of vertices in a graph G is called a legal dominating sequence if every vertex in the sequence dominates at least one vertex not dominated by those vertices that precede it, and at the end all vertices of G are dominated. While the length of a shortest such sequence is the domination number of G, in this paper we investigate legal dominating sequences of maximum length, which we call...
متن کاملTotal dominating sequences in graphs
A vertex in a graph totally dominates another vertex if they are adjacent. A sequence of vertices in a graph G is called a total dominating sequence if every vertex v in the sequence totally dominates at least one vertex that was not totally dominated by any vertex that precedes v in the sequence, and at the end all vertices of G are totally dominated. While the length of a shortest such sequen...
متن کاملRepetitions in Graphs and Sequences
The existence of unavoidable repeated substructures is a known phenomenon implied by the pigeonhole principle and its generalizations. A fundamental problem is to determine the largest size of a repeated substructure in any combinatorial structure from a given class. The strongest notion of repetition is a pair of isomorphic substructures, such as a pair of vertexdisjoint or edge-disjoint isomo...
متن کاملConstructing Incremental Sequences in Graphs
Given a weighted graph G = (V,E,w), we investigate the problem of constructing a sequence of n = |V | subsets of vertices M1, . . . ,Mn (called groups) with small diameters, where the diameter of a group is calculated using distances in G. The constraint on these n groups is that they must be incremental: M1 ⊂ M2 ⊂ · · · ⊂ Mn = V . The cost of a sequence is the maximum ratio between the diamete...
متن کاملChaotic frequency hopping sequences
This letter describes a novel family of frequency hopping sequences generated by chaotic systems. The sequences give a uniform spread over the entire frequency bandwidth. In addition to having good Hamming correlation properties, they possess ideal linear span. The sequences produce almost as good performance as random hopping patterns when used in frequency hopping code-division multiple-acces...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1974
ISSN: 0095-8956
DOI: 10.1016/0095-8956(74)90042-2